Well-covered graphs without cycles of lengths 4, 5 and 6
نویسندگان
چکیده
منابع مشابه
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G, the set of weight functions w such that G is w-well-covered is a vector space. Given an input graph G without cycles of length 4, 5, and 6, we cha...
متن کاملWell-dominated graphs without cycles of lengths 4 and 5
Let G be a graph. A set S of vertices in G dominates the graph if every vertex of G is either in S or a neighbor of a vertex in S. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph G is well-dominated if all its minimal dominating sets are of the same cardinality. The complexity status of recognizing well-dominated graphs is not known. We show that...
متن کاملAlmost Well-Covered Graphs Without Short Cycles
We study graphs in which the maximum and the minimum sizes of a maximal independent set differ by exactly one. We call these graphs almost well-covered, in analogy with the class of well-covered graphs, in which all maximal independent sets have the same size. A characterization of graphs of girth at least 8 having exactly two different sizes of maximal independent sets due to Finbow, Hartnell,...
متن کاملWeighted Well-Covered Graphs without Cycles of Length 4, 6 and 7
A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight function defined on the vertices of G. Then G is w-well-covered if all maximal independent sets of G are of the same weight. The set of weight functions w for which a graph is w-well-covered is a vector space. We prove...
متن کاملPlanar Graphs Without Cycles of Specific Lengths
It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5-cycles are also 3-degenerate. In this paper it is shown, more surprisingly, that the same holds for planar graphs without 6-cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.01.001